A Brief Note on Church-Turing Thesis and R.E. Sets
نویسنده
چکیده
People who believe in the Enhanced Church-Turing Thesis assume that the origin of every formalism for computable functions must be some sort of informal notions. Since all formalisms we ever have turn out to be equivalent, it must be the case that their origins are also equivalent. I hardly find myself at a position to believe in this, since I do not see sufficient reasons to further believe that nothing will lose when we try to formalize our informal notions of computation in symbols. We speak of those we can speak of, and pass a lot more in silence.
منابع مشابه
Classical Computability and Fuzzy Turing Machines
We work with fuzzy Turing machines (ftms) and we study the relationship between this computational model and classical recursion concepts such as computable functions, r.e. sets and universality. ftms are first regarded as acceptors. It has recently been shown in [23] that these machines have more computational power than classical Turing machines. Still, the context in which this formulation i...
متن کاملRecursively enumerable reals and Chaitin numbers ;
A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals. Following Solovay (unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp.) and Chaitin (IBM J. Res. Develop. 21 (1977) 350–359, 496.) we say that an r.e. real dominates an r.e. real if from a good approximation of from belo...
متن کاملDegrees of Weakly Computable Reals
A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...
متن کاملRandom Numbers and an Incomplete Immune Recursive Set
Generalizing the notion of a recursively enumerable (r.e.) set to sets of real numbers and other metric spaces is an important topic in computable analysis (which is the Turing machine based theory of computable real number functions). A closed subset of a computable metric space is called r.e. closed, if all open rational balls which intersect the set can be effectively enumerated and it is ca...
متن کاملOn the Church-Turing Thesis
After a brief description of the Church-Turing Thesis, we suggest that, according to the latest results on classical recursive probabilistic solution of the Halting Problem, such thesis is asymptotically false.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004